Hypergraph Partitioning With Embeddings

Memetic Multilevel Hypergraph Partitioning

Hypergraph partitioning has a wide range of important applications such as VLSI design or scientific computing. With focus on solution quality, we develop the first multilevel memetic algorithm to tackle the problem. Key components of our contribution are new effective multilevel recombination and mutation operations that provide a large amount of diversity. We perform a wide range of experimen...

Hypergraph Partitioning Techniques

Graph and hypergraph partitioning are important problems with applications in several areas including parallel processing, VLSI design automation, physical mapping of chromosomes and data classification. The problem is to divide the vertices of a hypergraph into k similar–sized blocks such that a given cost function defined over the hypergraph is optimized. The intent of this paper is to expose...

Multilevel Hypergraph Partitioning

Evolutionary Hypergraph Partitioning

The hypergraph partitioning problem has many applications like processor load balance or VLSI design. For most applications solution quality is crucial. Since the problem is NP-hard, heuristics and meta heuristics are used in practice to solve the problem. In this thesis we combine the commonly used multilevel heuristic with an evolutionary algorithm. Experimental results show that our new algo...

Hypergraph Partitioning and Clustering

A hypergraph is a generalization of a graph wherein edges can connect more than two vertices and are called hyperedges. Just as graphs naturally represent many kinds of information in mathematical and computer science problems, hypergraphs also arise naturally in important practical problems, including circuit layout, Boolean SATisfiability, numerical linear algebra, etc. Given a hypergraph H ,...